Some Shilla Graphs with b = 5 do not Exist

نویسندگان

چکیده

A Shilla graph is a distance-regular of diameter 3 that has second eigenvalue equal to = a3 . Koolen and Park found admissible arrays intersections the Shill graphs with b (there were 12 them). Belousov I.N. feasible intersection 4 50 them) 5 82 It proved in paper Schill {305,248,62;1,2,244}, {315,256,64;1,2,252}, {345,280,64;1,4,276},{615,496,124;1,4,492}, {815,656,164;1,2,652}, {855,688,172;1,4,684}, {855,688,170;1,5,684}, {910,732,180;1,10, 728}, {1000,804,201;1,3,800}, {1045,840,210;1,6,836}, {1055,848,212;1,4,844}, {1080,868,215;1,5,864}, {1155,928,232;1,2,924}, {1185,952,245;1,5,948}, {1235,992,248;1,8,988},{1535,1232,308;1,8,1228}, {1560,1252,310;1,10,1248}, {1615,1296,324;1,12,1292}, {1665,1336,334;1,2,1332} do not exist.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shilla distance-regular graphs

A Shilla distance-regular graph Γ (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph Γ, and for Γ we define b = b(Γ) := k a3 . In this paper we will show that there are finitely many Shilla distance-regular graphs Γ with fixed b(Γ) ≥ 2. Also, we will classify Sh...

متن کامل

Three-Way Systems Do Not Exist

We argue that argument encoding systems that seem to involve three syntactic core cases (nominative/absolutive, ergative, accusative) are actually common ergative or accusative systems syntactically, with overt case markers for each of the two cases that disappear in intransitive contexts. Based on evidence from Kham, Djapu, Nez Perce, Upriver Halkomelem, Dyirbal, and Pitjantjatjara, we show th...

متن کامل

Balanced Distributed Search Trees Do Not Exist

This paper is a rst step towards an understanding of the inherent limitations of distributed data structures. We propose a model of distributed search trees that is based on few natural assumptions. We prove that any class of trees within our model satis es a lower bound of (pm) on the worst case height of distributed search trees for m keys. That is, unlike in the single site case, balance in ...

متن کامل

Do not forget: coronary spasm does exist!

A 36-year old woman was proposed for urgent revascularization for severe left coronary disease with left main involvement diagnosed in the setting of acute coronary syndrome with ST-elevation. Considering the patient’s age and gender, coronariography was repeated under vasodilator therapy (Fig. 1, Supplementary Video 1 and 2). Coronary spasm was revealed. Supplementary material is available at ...

متن کامل

Cannon–thurston Maps Do Not Always Exist

We construct a hyperbolic group with a hyperbolic subgroup for which inclusion does not induce a continuous map of the boundaries. 2010 Mathematics Subject Classification: 20F67

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Vestnik Permskogo universiteta

سال: 2022

ISSN: ['1993-0550']

DOI: https://doi.org/10.17072/1993-0550-2022-2-40-45